A New Algorithm for Solving Cross–Coupled Algebraic Riccati Equations of Singularly Perturbed Nash Games

نویسندگان

  • Hiroaki Mukaidani
  • Hua Xu
  • Koichi Mizukami
چکیده

In this paper, we study the linear quadratic Nash games for infinite horizon singularly perturbed systems. In order to solve the problem, we must solve a pair of cross–coupled algebraic Riccati equations with a small positive parameter ε. As a matter of fact, we propose a new algorithm, which combines Lyapunov iterations and the generalized Lyapunov equation direct method, to solve the cross–coupled algebraic Riccati equations. The new algorithm ensures that the solution of the cross–coupled algebraic Riccati equations converges to a positive semidefinite stabilizing solution. Furthermore, in order to solve the cross–coupled algebraic Riccati equations, we propose a new Riccati iterations method different from existing method. As another important feature of this paper, our method is applicable to both standard and nonstandard singularly perturbed systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Numerical Algorithm for Solving Cross–Coupled Algebraic Riccati Equations Related to Nash Games of Multimodeling Systems

In this paper, the numerical design of a Nash equilibrium for infinite horizon multiparameter singularly perturbed systems (MSPS) is analyzed. A new algorithm which is based on the Newton’s method for solving the generalized cross–coupled multiparameter algebraic Riccati equations (GCMARE) is proposed. It is proven that the proposed algorithm guarantees the quadratic convergence. As a result, i...

متن کامل

Numerical computation of cross-coupled algebraic Riccati equations related to H2=H1 control problem for singularly perturbed systems

In this paper, we present a numerical algorithm to the cross-coupled algebraic Riccati equations(CARE) related to H2=H1 control problems for singularly perturbed systems (SPS) by means of Newton’s method. The resulting algorithm can be widely used to solve Nash game problems and robust control problems because the CARE is solvable even if the quadratic term has an indefinite sign. We prove that...

متن کامل

Efficient numerical procedures for solving closed-loop Stackelberg strategies with small singular perturbation parameter

In this paper, the computation of the linear closed-loop Stackelberg strategies with small singular perturbation parameter that characterizes singularly perturbed systems (SPS) are studied. The attention is focused on a new numerical algorithm for solving a set of cross-coupled algebraic Lyapunov and Riccati equations (CALRE). It is proven that the new algorithm guarantees the local quadratic c...

متن کامل

The Linear Quadratic Regulator Problem for a Class of Controlled Systems Modeled by Singularly Perturbed Itô Differential Equations

This paper discusses an infinite-horizon linear quadratic (LQ) optimal control problem involving stateand control-dependent noise in singularly perturbed stochastic systems. First, an asymptotic structure along with a stabilizing solution for the stochastic algebraic Riccati equation (ARE) are newly established. It is shown that the dominant part of this solution can be obtained by solving a pa...

متن کامل

Numerical solution of stochastic Nash games with state-dependent noise for weakly coupled large-scale systems

This paper discusses the infinite horizon stochastic Nash games with state-dependent noise. After establishing the asymptotic structure along with the positive semidefiniteness for the solutions of the cross-coupled stochastic algebraic Riccati equations (CSAREs), a new algorithm that combines Newton’s method with two fixed point algorithms for solving the CSAREs is derived. As a result, it is ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000